Axiomatisation of Functional Dependencies in Incomplete Relations

نویسندگان

  • Mark Levene
  • George Loizou
چکیده

Incomplete relations are relations which contain null values, whose meaning is \value is at present unknown". Such relations give rise to two types of functional dependency (FD). The rst type, called the strong FD (SFD), is satissed in an incomplete relation if for all possible worlds of this relation the FD is satissed in the standard way. The second type, called the weak FD (WFD), is satissed in an incomplete relation if there exists a possible world of this relation in which the FD is satissed in the standard way. We exhibit a sound and complete axiom system for both strong and weak FDs, which takes into account the interaction between SFDs and WFDs. A interesting feature of the combined axiom system is that it is not k-ary for any natural number k 0. We show that the combined implication problem for SFDs and WFDs can be solved in time polynomial in the size of the input set of FDs. Finally, we show that Armstrong relations exist for SFDs and WFDs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recovery from Inconsistency in Incomplete Relations

It is not always possible to avoid inconsistency of a set of constraints in a database, for example in a legacy database where we are given an out of date set of constraints which may have changed due to maintenance. Thus we need some mechanism to reassess the set of constraints in order to recover from this inconsistency. We tackle this problem concentrating on the situation when the constrain...

متن کامل

On the Implication of Multivalued Dependencies in Partial Database Relations

The implication of multivalued dependencies (MVDs) in relational databases has originally and independently been denned in the context of some fixed finite universe by Delobel, Fagin, and Zaniolo. Biskup observed that the original axiomatisation for MVD implication does not reflect the fact that the complementation rule is merely a means to achieve database normalisation. He proposed two altern...

متن کامل

On Inferences of Full Hierarchical Dependencies

Full hierarchical dependencies (FHDs) constitute a large class of relational dependencies. A relation exhibits an FHD precisely when it can be decomposed into at least two of its projections without loss of information. Therefore, FHDs generalise multivalued dependencies (MVDs) in which case the number of these projections is precisely two. The implication of FHDs has been defined in the contex...

متن کامل

Functional Dependencies with Counting on Trees

The paper presents an axiomatisation for functional dependencies on trees that are defined using constructors for records, lists, sets and multisets. A simple form of restructuring permitting lists to be mapped onto multisets and multisets onto sets is added to the theory. Furthermore, the theory handles dependencies on sets treated as multisets. This adds the possibility to use the count of el...

متن کامل

Appropriate Reasoning about Data Dependencies in Fixed and Undetermined Universes

We study inference systems for the combined class of functional and full hierarchical dependencies in relational databases. Two notions of implication are considered: the original version in which the underlying set of attributes is fixed, and the alternative notion in which this set is left undetermined. The first main result establishes a finite axiomatisation in fixed universes which clarifi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 206  شماره 

صفحات  -

تاریخ انتشار 1998